Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar4/RubioSLASHprov.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

ackin₂(s₁(X), s₁(Y)) -> u21₂(ackin₂(s₁(X), Y), X)
u21₂(ackout₁(X), Y) -> u22₁(ackin₂(Y, X))

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

ackin₂(s₁(X), s₁(Y)) -> u21₂(ackin₂(s₁(X), Y), X)
u21₂(ackout₁(X), Y) -> u22₁(ackin₂(Y, X))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

ackin₂(s₁(X), s₁(Y)) -> u21₂(ackin₂(s₁(X), Y), X)
u21₂(ackout₁(X), Y) -> u22₁(ackin₂(Y, X))

The set Q consists of the following terms:

ackin₂(s₁(x0), s₁(x1))
u21₂(ackout₁(x0), x1)

Q DP problem:
The TRS P consists of the following rules:

U21₂(ackout₁(X), Y) -> ACKIN₂(Y, X)
ACKIN₂(s₁(X), s₁(Y)) -> ACKIN₂(s₁(X), Y)
ACKIN₂(s₁(X), s₁(Y)) -> U21₂(ackin₂(s₁(X), Y), X)

The TRS R consists of the following rules:

ackin₂(s₁(X), s₁(Y)) -> u21₂(ackin₂(s₁(X), Y), X)
u21₂(ackout₁(X), Y) -> u22₁(ackin₂(Y, X))

The set Q consists of the following terms:

ackin₂(s₁(x0), s₁(x1))
u21₂(ackout₁(x0), x1)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

U21₂(ackout₁(X), Y) -> ACKIN₂(Y, X)
ACKIN₂(s₁(X), s₁(Y)) -> ACKIN₂(s₁(X), Y)
ACKIN₂(s₁(X), s₁(Y)) -> U21₂(ackin₂(s₁(X), Y), X)

The TRS R consists of the following rules:

ackin₂(s₁(X), s₁(Y)) -> u21₂(ackin₂(s₁(X), Y), X)
u21₂(ackout₁(X), Y) -> u22₁(ackin₂(Y, X))

The set Q consists of the following terms:

ackin₂(s₁(x0), s₁(x1))
u21₂(ackout₁(x0), x1)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 1 SCC with 2 less nodes.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

ACKIN₂(s₁(X), s₁(Y)) -> ACKIN₂(s₁(X), Y)

The TRS R consists of the following rules:

ackin₂(s₁(X), s₁(Y)) -> u21₂(ackin₂(s₁(X), Y), X)
u21₂(ackout₁(X), Y) -> u22₁(ackin₂(Y, X))

The set Q consists of the following terms:

ackin₂(s₁(x0), s₁(x1))
u21₂(ackout₁(x0), x1)

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

ACKIN₂(s₁(X), s₁(Y)) -> ACKIN₂(s₁(X), Y)

Used argument filtering: ACKIN₂(x1, x2) = x2
s₁(x1) = s₁(x1)
Used ordering: Quasi Precedence: trivial

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPAfsSolverProof

                ↳ QDP

                  ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

ackin₂(s₁(X), s₁(Y)) -> u21₂(ackin₂(s₁(X), Y), X)
u21₂(ackout₁(X), Y) -> u22₁(ackin₂(Y, X))

The set Q consists of the following terms:

ackin₂(s₁(x0), s₁(x1))
u21₂(ackout₁(x0), x1)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.